- improved approximation methods
- Макаров: усовершенствованные методы приближения
Универсальный англо-русский словарь. Академик.ру. 2011.
improved approximation methods
Смотреть что такое "improved approximation methods" в других словарях:
Diophantine approximation — In number theory, the field of Diophantine approximation, named after Diophantus of Alexandria, deals with the approximation of real numbers by rational numbers. The absolute value of the difference between the real number to be approximated and… … Wikipedia
Discrete dipole approximation — In discrete dipole approximation larger object is approximated in terms of discrete dipoles The discrete dipole approximation (DDA) is a method for computing scattering of radiation by particles of arbitrary shape and by periodic structures.… … Wikipedia
General relativity — For a generally accessible and less technical introduction to the topic, see Introduction to general relativity. General relativity Introduction Mathematical formulation Resources … Wikipedia
EDUCATION, JEWISH — This entry is arranged according to the following outline. Bibliography at the end of a section is indicated by (†). in the biblical period the nature of the sources historical survey the patriarchal period and the settlement the kingdom the… … Encyclopedia of Judaism
algebra — /al jeuh breuh/, n. 1. the branch of mathematics that deals with general statements of relations, utilizing letters and other symbols to represent specific sets of numbers, values, vectors, etc., in the description of such relations. 2. any of… … Universalium
Maximum cut — A maximum cut. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max cut problem. The problem can be stated simply as follows. One wants a subset… … Wikipedia
Maximal cut — For a graph, a maximal cut is a cut with the size not smaller than the size of any other cut. The problem of finding a maximal cut is a graph is known as the max cut problem.Max cut problemThe max cut problem is one of Karp s 21 NP complete… … Wikipedia
Cut (graph theory) — In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. The cut set of the cut is the set of edges whose end points are in different subsets of the partition. Edges are said to be crossing the cut if they are… … Wikipedia
Sidney Dancoff — Sidney Michael Dancoff (1914–1951) was an American theoretical physicist best known for the Tamm Dancoff approximation method and for nearly developing a renormalization method for solving quantum electrodynamics (QED).While Dancoff was at the… … Wikipedia
Fulkerson-Preis — Der Fulkerson Preis ist ein von der Mathematical Programming Society (MPS) und der American Mathematical Society (AMS) alle drei Jahre vergebener Preis für außergewöhnliche Arbeiten in diskreter Mathematik, worunter zum Beispiel Kombinatorik und… … Deutsch Wikipedia
Optimal design — This article is about the topic in the design of experiments. For the topic in optimal control theory, see shape optimization. Gustav Elfving developed the optimal design of experiments, and so minimized surveyors need for theodolite measurements … Wikipedia
